Local splicing grammar systems
نویسنده
چکیده
A new type of splicing is defined, namely the interchange of two fixed subwords, without moving the sequences situated after them. Idea of splicing grammar systems is introduced by Dassow and Mitrana, ([2]); in this paper only the derivation type is changed. The generative power is the same (are necessarily only two modules to generate all recursive enumerable languages). Two variants of derivation are considered more detailed (when at every step the rules used have the same left part, and an asincronous derivation when it is possible to apply rules only in a subset of components). The generative power remains the same but some normal forms are possible to be defined.
منابع مشابه
Alphabetic Flat Splicing Pure Context-free Grammar Systems
In the context of DNA computing, an operation on words, called splicing, was introduced by Head (1987), in his study on recombinant behavior of DNA molecules. Recently, a special kind of splicing, called flat splicing on strings, was considered and several properties were derived. On the other hand, in the study of modelling of distributed complex systems based on language theory, grammar syste...
متن کاملFlat Splicing Array Grammar Systems Generating Picture Arrays
While studying the recombinant behaviour of DNA molecules, Head (1987) introduced a new operation, called splicing on words or strings, which are finite sequences of symbols. There has been intensive research using the concept of splicing on strings in the context of DNA computing, establishing important theoretical results on computational universality. A particular class of splicing, known as...
متن کاملCdmtcs Research Report Series Cooperating Distributed Splicing Systems Cooperating Distributed Splicing Systems
We introduce a new class of cooperating distributed H systems which consist of a given set of splicing systems (sets of splicing rules plus sets of axioms), similar in form to the cooperating distributed grammar systems. By applying iteratively the components of such a system (starting from a given initial string), in a sequence which runs nondeterministically, in such a way that a step is cons...
متن کاملDNA Computing Based on Splicing: Universality Results.dvi
The paper extends some of the most recently obtained results on the computational universality of extended H systems (with regular sets of rules respectively with finite sets of rules used with simple additional mechanisms) and shows the possibility to obtain universal systems based on these extended H systems, i. e. the theoretical possibility to design programmable universal DNA computers bas...
متن کاملUniversal Grammar and Chaos/Complexity Theory: Where Do They Meet And Where Do They Cross?
Abstract The present study begins by sketching "Chaos/Complexity Theory" (C/CT) and its applica-tion to the nature of language and language acquisition. Then, the theory of "Universal Grammar" (UG) is explicated with an eye to C/CT. Firstly, it is revealed that CCT may or may not be allied with a theory of language acquisition that takes UG as the initial state of language acquisition for ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2002